Cyclicity of coefficient multipliers: Linear structure
نویسندگان
چکیده
منابع مشابه
Approximate convolution using DCT coefficient multipliers
DCT-domain processing, filtering, convolution, image enhancement, quantization tables We develop a method for designing DCT coefficient multipliers in order to approximate the operation of 2D convolution of an image with a given kernel. The method is easy to implement on compressed formats of DCT-based compression methods (JPEG, MPEG, H.261) by applying decoding quantization tables that are inc...
متن کاملA Linear Constraint Satisfaction Approach to Cyclicity
Abductive reasoning (or explanation) is basically a backward-chaining process on a collection of causal rules. When given an observed event, we attempt to determine the set of causes which brought about this event. Cost-based abduction is a model for abductive reasoning which provides a concrete formulation of the explanation process. However, it restricts itself to acyclic causal knowledge bas...
متن کاملCurrent Mode Multipliers and Constant Coefficient Multipliers for Radix N and modulo N Logic Arithmetic
This paper presents new structures of combinatorial and constant coefficient multipliers based on the current-mode gates – digital elements operating with constant, continuous power supply current. Current mode circuits do not perturb the analogue part of the chip integrated on the same die through the parasitic coupling across the substrate with the same strength as voltage mode circuits do. D...
متن کاملSwitching Activity in Bit-Serial Constant-Coefficient Serial/Parallel Multipliers
Bit-serial architectures have the advantage of high throughput, area efficient multipliers. These multipliers are implemented using shift-add operations [1], with full adders and D flip-flops as building blocks. Multiplication with a constant fixed-point coefficient is commonly used in digital signal processing (DSP) circuits, such as digital filters [2][3]. The design of a constant-coefficient...
متن کاملCyclicity and Decoding of Linear Error-block Codes
Linear error-block codes (LEBC) were introduced in [1]. They are a natural generalization of linear error correcting codes. In this paper, we introduce a notion of cyclic LEBC. In order to allow application in cryptography, especially in a McEliece-like cryptosystem [3], a method of decoding this kind of codes is presented. There exist linear error-block codes with fast decoding algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Hungarica
سال: 2007
ISSN: 0236-5294,1588-2632
DOI: 10.1007/s10474-007-5125-7